Computationally Constrained Beliefs

نویسنده

  • Drew McDermott
چکیده

People and intelligent computers, if there ever are any, will both have to believe certain things in order to be intelligent agents at all, or to be a particular sort of intelligent agent. I distinguish implicit beliefs that are inherent in the architecture of a natural or artificial agent, in the way it is “wired,” from explicit beliefs that are encoded in a way that makes them easier to learn and to erase if proven mistaken. I introduce the term IFI, which stands for irresistible framework intuition, for an implicit belief that can come into conflict with an explicit one. IFIs are a key element of any theory of consciousness that explains qualia and other aspects of phenomenology as second-order beliefs about perception. Before I can survey the IFI landscape, I review evidence that the brains of humans, and presumably of other intelligent agents, consist of many specialized modules that (a) are capable of sharing a unified workspace on urgent occasions, and (b) jointly model themselves as a single agent. I also review previous work relevant to my subject. Then I explore several IFIs, starting with, “My future actions are free from the control of physical laws.” Most of them are universal, in the sense that they will be shared by any intelligent

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Beliefs on Individual Variables from a Single Source to Beliefs on the Joint Space under Dempster-Shafer Theory - An Algorithm

It is quite common in real world situations to form beliefs under Dempster-Shafer (DS) theory on various variables from a single source. This is true, in particular, in auditing. Also, the judgment about these beliefs is easily made in terms of simple support functions on individual variables. However, for propagating beliefs in a network of variables, one needs to convert these beliefs on indi...

متن کامل

A Simple Adaptive Algorithm for Norm-Constrained Optimization

In this paper we propose a simple adaptive algorithm iteratively solving the unit-norm constrained optimization problem. Instead of conventional parameter norm based normalization, the proposed algorithm incorporates scalar normalization which is computationally much simpler. The analysis of stationary point is presented to show that the proposed algorithm indeed solves the constrained optimiza...

متن کامل

Recipient design in human communication: simple heuristics or perspective taking?

Humans have a remarkable capacity for tuning their communicative behaviors to different addressees, a phenomenon also known as recipient design. It remains unclear how this tuning of communicative behavior is implemented during live human interactions. Classical theories of communication postulate that recipient design involves perspective taking, i.e., the communicator selects her behavior bas...

متن کامل

On safe tractable approximations of chance constraints

A natural way to handle optimization problem with data affected by stochastic uncertainty is to pass to a chance constrained version of the problem, where candidate solutions should satisfy the randomly perturbed constraints with probability at least 1− . While being attractive from modeling viewpoint, chance constrained problems “as they are” are, in general, computationally intractable. In th...

متن کامل

Slope Stability Analysis Using a Self-Adaptive Genetic Algorithm

This paper introduces a methodology for soil slope stability analysis based on optimization, limit equilibrium principles and method of slices. In this study, the slope stability analysis problem is transformed into a constrained nonlinear optimization problem. To solve that, a Self-Adaptive Genetic Algorithm (GA) is utilized. In this study, the slope stability safety factors are the objective ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012